paley digraph造句

• "' Paley digraphs "'are tournaments with a property previously known to be held only by random tournaments : in a Paley digraph, every small subset of vertices is dominated by some other vertex.
• "' Paley digraphs "'are tournaments with a property previously known to be held only by random tournaments : in a Paley digraph, every small subset of vertices is dominated by some other vertex.
• In this case ( the Paley biplane, obtained from the Paley digraph of order 11 ), the points are the affine line ( the finite field ) "'F "'11, where the first line is defined to be the five non-zero quadratic residues ( points which are squares : 1, 3, 4, 5, 9 ), and the other lines are the affine translates of this ( add a constant to all the points ) . " L " 2 ( 11 ) is then isomorphic to the subgroup of " S " 11 that preserve this geometry ( sends lines to lines ), giving a set of 11 points on which it acts  in fact two : the points or the lines, which corresponds to the outer automorphism  while " L " 2 ( 5 ) is the stabilizer of a given line, or dually of a given point.